Graph access structures with optimal pixel expansion three
نویسندگان
چکیده
منابع مشابه
MAXIMAL INDEPENDENT SETS FOR THE PIXEL EXPANSION OF GRAPH ACCESS STRUCTURE
Given a graph G, a visual cryptography scheme based on the graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper we apply maximal independent sets of the grap...
متن کاملMaximal Independent Sets for the Pixel Expansion of Graph Access Structure
Abstract : A visual cryptography scheme based on a given graph G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the graph G was ...
متن کاملOn the Pixel Expansion of Hypergraph Access Structures in Visual Cryptography Schemes
In a visual cryptography scheme, a secret image is encoded into n shares, in the form of transparencies. The shares are then distributed to n participants. Qualified subsets of participants can recover the secret image by superimposing their transparencies, but non-qualified subsets of participants have no information about the secret image. Pixel expansion, which represents the number of subpi...
متن کاملVisual cryptography schemes with optimal pixel expansion
A visual cryptography scheme encodes a black & white secret image into n shadow images called shares which are distributed to the n participants. Such shares are such that only qualified subsets of participants can “visually” recover the secret image. Usually, the reconstructed image will be darker than the background of the image itself. In this paper we consider visual cryptography schemes sa...
متن کاملOn Optimal Multiversion Access Structures
We propose an asymptotically optimal multiversion B-tree. In our setting, insertions and deletions of data items are allowed only for the present version, whereas range queries and exact match queries are allowed for any version, present or past. The technique we present for transforming a (usual single version) B-tree into a multiversion B-tree is more general: it applies to a number of spatia...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2013
ISSN: 0890-5401
DOI: 10.1016/j.ic.2013.07.002